↳ HASKELL
↳ CR
((maxFM :: FiniteMap Ordering a -> Maybe Ordering) :: FiniteMap Ordering a -> Maybe Ordering) |
import qualified Maybe import qualified Prelude |
|||||||||||||||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||||||||||||||
maxFM :: Ord a => FiniteMap a b -> Maybe a
|
import qualified FiniteMap import qualified Prelude |
case maxFM fm_r of Nothing → Just key Just key1 → Just key1
maxFM0 key Nothing = Just key maxFM0 key (Just key1) = Just key1
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
((maxFM :: FiniteMap Ordering a -> Maybe Ordering) :: FiniteMap Ordering a -> Maybe Ordering) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||
maxFM :: Ord a => FiniteMap a b -> Maybe a
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
((maxFM :: FiniteMap Ordering a -> Maybe Ordering) :: FiniteMap Ordering a -> Maybe Ordering) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap a b = EmptyFM | Branch a b Int (FiniteMap a b) (FiniteMap a b) |
|||||||||
maxFM :: Ord a => FiniteMap a b -> Maybe a
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
undefined
| False
= undefined
undefined = undefined1
undefined0 True = undefined
undefined1 = undefined0 False
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
(maxFM :: FiniteMap Ordering a -> Maybe Ordering) |
import qualified Maybe import qualified Prelude |
|||||||||
data FiniteMap b a = EmptyFM | Branch b a Int (FiniteMap b a) (FiniteMap b a) |
|||||||||
maxFM :: Ord b => FiniteMap b a -> Maybe b
|
|||||||||
|
import qualified FiniteMap import qualified Prelude |
↳ HASKELL
↳ CR
↳ HASKELL
↳ BR
↳ HASKELL
↳ COR
↳ HASKELL
↳ Narrow
↳ QDP
↳ QDPSizeChangeProof
new_maxFM(Branch(wv30, wv31, wv32, wv33, wv34), h) → new_maxFM(wv34, h)
From the DPs we obtained the following set of size-change graphs: